A Memory-Access-Efficient Implementation for Computing the Approximate String Matching Algorithm on GPUs
نویسندگان
چکیده
منابع مشابه
A Faster Algorithm for Approximate String Matching
We present a new algorithm for on line approximate string matching The algorithm is based on the simulation of a non deterministic nite automaton built from the pattern and using the text as input This simulation uses bit operations on a RAM machine with word length O log n being n the maximum size of the text The running time achieved is O n for small patterns i e m O p log n independently of ...
متن کاملA Consensus Algorithm for Approximate String Matching
Approximate string matching (ASM) is a well-known computational problem with important applications in database searching, plagiarism detection, spelling correction, and bioinformatics. The two main issues with most ASM algorithms are (1) computational complexity, and (2) low specificity due to a large amount of false positives being reported. In this paper, a very efficient ASM method is propo...
متن کاملA Fast Algorithm for Approximate String Matching on Gene Sequences
Approximate string matching is a fundamental and challenging problem in computer science, for which a fast algorithm is highly demanded in many applications including text processing and DNA sequence analysis. In this paper, we present a fast algorithm for approximate string matching, called FAAST. It aims at solving a popular variant of the approximate string matching problem, the k-mismatch p...
متن کاملAn Improved Algorithm for Approximate String Matching
Given a text string, a pattern string, and an integer k, a new algorithm for finding all occurrences of the pattern string in the text string with at most k differences is presented. Both its theoretical and practical variants improve the known algorithms . • Work supported in part by NSF Grants CCR-86-05353 and CCR-88-14977 1 Department of Computer Science, Columbia University, New York, NY 10...
متن کاملMemory Efficient String Matching Algorithm for Network Intrusion Management System
As the core algorithm and the most time consuming part of almost every modern network intrusion management system (NIMS), string matching is essential for the inspection of network flows at the line speed. This paper presents a memory and time efficient string matching algorithm specifically designed for NIMS on commodity processors. Modifications of the Aho-Corasick (AC) algorithm based on the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEICE Transactions on Information and Systems
سال: 2016
ISSN: 0916-8532,1745-1361
DOI: 10.1587/transinf.2016pap0024